Static Program Slicing Algorithms are Minimal for Free Liberal Program Schemas
نویسندگان
چکیده
1Department of Computing, Goldsmiths College, University of London, New Cross, London SE14 6NW, UK 2Department of Computer Science, University of Essex, Colchester CO4 3SQ, UK 3Department of Computer Science, King’s College London, Strand, London WC2R 2LS, UK 4School of Information Systems, Computing and Mathematics, Brunel University, Uxbridge, Middlesex UB8 3PH, UK 5@UK PLC, 5 Jupiter House, Calleva Park, Aldermaston, Berkshire RG7 8NN,UK 6Department of Computer Science, University of Liverpool, Peach Street, Liverpool L69 3BX, UK Email: [email protected]
منابع مشابه
Characterizing minimal semantics-preserving slices of function-linear, free, liberal program schemas
A program schema defines a class of programs, all of which have identical statement structure, but whose functions and predicates may differ. A schema thus defines an entire class of programs according to how its symbols are interpreted. As defined in this paper, a slice of a schema is obtained from a schema by deleting some of its statements. We prove that given a schema S which is functionlin...
متن کاملCharacterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas
A program schema defines a class of programs, all of which have identical statement structure, but whose functions and predicates may differ. A schema thus defines an entire class of programs according to how its symbols are interpreted. A subschema of a schema is obtained from a schema by deleting some of its statements. We prove that given a schema S which is predicate-linear, free and libera...
متن کاملDecidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas
A program schema defines a class of programs, all of which have identical statement structure, but whose functions and predicates may differ. A schema thus defines an entire class of programs according to how its symbols are interpreted. Two schemas are strongly equivalent if they always define the same function from initial states to final states for every interpretation. A subschema of a sche...
متن کاملEfficient Program Slicing Algorithms for Measuring Functional Cohesion and Parallelism
Program slicing is the task of finding all statements in a program that directly or indirectly influence the value of a variable occurrence. The set of statements that can affect the value of a variable at some point in a program is called a program slice. In several software engineering applications, such as program debugging and measuring program cohesion and parallelism, several slices are c...
متن کاملDecidability of Strong Equivalence for Slices of a Class of Linear, Free, near-Liberal Program Schemas
A program schema defines a class of programs, all of which have identical statement structure, but whose functions and predicates may differ. A schema thus defines an entire class of programs according to how its symbols are interpreted. Two schemas are strongly equivalent if they always define the same function from initial states to final states for every interpretation. A slice of a schema i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. J.
دوره 48 شماره
صفحات -
تاریخ انتشار 2005